package com.example.leetcode.graph;

import com.example.leetcode.graph.common.GraphUtils;

class Solution1135 {
    public int minimumCost(int n, int[][] connections) {
        return GraphUtils.minimumCost(n, connections);
    }
}

public class leetcode1135 {
    public static void main(String[] args) {
        Solution1135 solution1135 = new Solution1135();
        int[][] conections = {{1, 2, 5}, {1, 3, 6}, {2, 3, 1}};
        System.out.println(solution1135.minimumCost(3, conections));
    }
}
